Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game
نویسندگان
چکیده
منابع مشابه
Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game
Consider a communication network represented by a directed graph G = (V, E) of n nodes and m edges. Assume that edges in E are partitioned into two sets: a set C of edges with a fixed non-negative real cost, and a set P of edges whose price should instead be set by a leader. This is done with the final intent of maximizing the payment she will receive for their use by a follower, whose goal is ...
متن کاملStackelberg Game Modeling of Pricing for Mobile Virtual Network Operators
With rapid development of new network technologies, demands of network users grow dramatically. Primary mobile network operators (POs) cannot meet the demands of users. Therefore, secondary mobile virtual network operators (SOs) emerge to alleviate pressure on the network market. Obviously, the competition becomes more serious, for users have more choices for operators based on their requiremen...
متن کاملAn approximation algorithm for Stackelberg network pricing
We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assigned to toll-compatible shortest paths. We first prove that this problem is strongly NP-hard. We then provide a polynomial time algorithm with a worst-case precision guarantee of 12 log2 mT +1, where mT denotes the number of toll arcs. Finally ...
متن کاملImproved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may assign prices to the pricable edges. Based on the predefined fixed costs and our prices, a customer purchases a cheapest s-t-path in G and we receive payment equal to the sum of prices of pricable edges belonging to ...
متن کاملStackelberg network pricing is hard to approximate
In the Stackelberg network pricing problem, one has to assign tariffs to a certain subset of the arcs of a given transportation network. The aim is to maximize the amount paid by the user of the network, knowing that the user will take a shortest st-path once the tariffs are fixed. Roch, Savard, and Marcotte (Networks, Vol. 46(1), 57–67, 2005) proved that this problem is NP-hard, and gave an O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2020
ISSN: 1999-4893
DOI: 10.3390/a14010008